Matrix nearness-based guaranteed passive system approximation
نویسنده
چکیده
In this paper we present a new approach towards global passive approximation in order to find a passive real-rational transfer function G(s) that is an arbitrarily close approximation of the passive transfer function nearest to a non-passive square transfer function H(s). It is based on existing solutions to pertinent matrix nearness problems. It is shown that the key point in constructing the passive real-rational transfer function G(s), is to find a good rational approximation of the well-known ramp function over an interval defined by the minimum andmaximum dissipation of H(s). The proposed algorithms rely on the stable–anti-stable decomposition of a given transfer function. Pertinent examples are given to show the scope and accuracy of the proposed algorithms.
منابع مشابه
Global passive system approximation
In this paper we present a new approach towards global passive approximation in order to find a passive transfer function G(s) that is nearest in some well-defined matrix norm sense to a non-passive transfer function H(s). It is based on existing solutions to pertinent matrix nearness problems. It is shown that the key point in constructing the nearest passive transfer function, is to find a go...
متن کاملSimilarity as Nearness: Information Quanta, Approximation Spaces and Nearness Structures
The present paper investigates approximation spaces in the context of topological structures which axiomatise the notion of nearness. Starting with the framework of information quanta which distinguishes two levels of information structures, namely property systems (the first level) and information quantum relational systems (the second level), we shall introduce the notion of Pawlak’s property...
متن کاملThe Metric Nearness Problem
Metric nearness refers to the problem of optimally restoring metric properties to distance measurements that happen to be non-metric due to measurement errors or otherwise. Metric data can be important in various settings, for example in clustering, classification, metric-based indexing, query processing and graph theoretic approximation algorithms. This paper formulates and solves the metric n...
متن کاملMatrix Nearness Problems with Bregman Divergences
This paper discusses a new class of matrix nearness problems that measure approximation error using a directed distance measure called a Bregman divergence. Bregman divergences offer an important generalization of the squared Frobenius norm and relative entropy, and they all share fundamental geometric properties. In addition, these divergences are intimately connected with exponential families...
متن کاملLow rank differential equations for Hamiltonian matrix nearness problems
For a Hamiltonian matrix with purely imaginary eigenvalues, we aim to determine the nearest Hamiltonian matrix such that some or all eigenvalues leave the imaginary axis. Conversely, for a Hamiltonian matrix with all eigenvalues lying off the imaginary axis, we look for a nearest Hamiltonian matrix that has a pair of imaginary eigenvalues. The Hamiltonian matrices can be allowed to be complex o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Systems & Control Letters
دوره 62 شماره
صفحات -
تاریخ انتشار 2013